Translating Multi-Agent Autoepistemic Logic into Logic Program

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic

Since Konol ige's t ranslat ion of default logic i n to st rongly grounded autoepistemic logic, several other variants of Moore's or ig inal autoepistemic logic tha t embody default logic have been s tud ied. A l l these logics differ signif icant ly f rom Moore's autoepistemic logic (stan dard A E L ) in tha t expansions are subject to add i t iona l groundedness-coridit ioris. Hence, the ques...

متن کامل

Embedding Minimal Knowledge into Autoepistemic Logic

We investigate the epistemological properties of MKNF, Lif-schitz's logic of minimal knowledge and negation as failure. In particular, we show that the expressive power of MKNF is equivalent to Moore's au-toepistemic logic (AEL), by deening an embedding of MKNF into AEL and vice versa. We also prove that the negation as failure modality not of MKNF exactly corresponds to the negative introspect...

متن کامل

Translating Spanish into Logic through Logic

We discuss the use of logic for natural language (NL) processing, both as an internal query language and as a programming tool. Some extensions of standard predicate calculus are motivated by the first of these roles. A logical system including these extensions is informally described. It incorporates semantic as well as syntactic NL features, and its semantics in a given interpretation (or dat...

متن کامل

Embedding Non-Ground Logic Programs into Autoepistemic Logic

T τEB og = T τEH og follows from this claim, thereby establishing the first part of the proposition, concerning the embeddings τEB and τEH . Every entailed objective ground formula is equivalent to a conjunction of ground clauses c = l1 ∨ · · · ∨ lk, where each li is either an atom pi or a negated atom ¬pi. Clearly, Toga |= c iff li ∈ Toga for some li in c. To prove (2), clearly T τ og ⊇ {φ ∈ L...

متن کامل

Reflective Autoepistemic Logic and Logic Programming

In this paper we show that reflexive autoepistemic logic of Schwarz is a particularly convenient modal formalism for studying properties of answer sets for logic programs with classical negation and disjunctive logic programs. Syntactical properties of logic programs imply that a natural interpretation of default logic in the logic of minimal knowledge (nonmonotonic S4F) provides also a modal r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the Japanese Society for Artificial Intelligence

سال: 2002

ISSN: 1346-0714,1346-8030

DOI: 10.1527/tjsai.17.114